Lagrangean duals and exact solution to the capacitated p-center problem
نویسندگان
چکیده
منابع مشابه
Lagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP ) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP , and we propose two different Lagrangean duals based on each of the auxiliary problems. The lower and upper bounds provided by each of the Lagrangean duals reduce notably the set of candidate radii and allow to solve the proble...
متن کاملAn exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the facility to which it is assigned (capacitated p-center). The algorithm iteratively sets a maximum distance value within which it tries to assign all clients, and thus solves bin-pa...
متن کاملModeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
Article history: Received 28 June 2011 Received in revised form 5 June 2012 Accepted 3 July 2012 Available online 16 August 2012
متن کاملThe Capacitated K-Center Problem
The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation...
متن کاملThe Heterogeneous Capacitated k-Center Problem
In this paper we initiate the study of the heterogeneous capacitated k-center problem: given a metric space X = (F ∪C, d), and a collection of capacities. The goal is to open each capacity at a unique facility location in F , and also to assign clients to facilities so that the number of clients assigned to any facility is at most the capacity installed; the objective is then to minimize the ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2009.02.022